Generalized “Yoking-Proofs” and Inter-Tag Communication
نویسندگان
چکیده
ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to persons or property arising out of the use of any materials, instructions, methods or ideas contained inside. After this work has been published by the In-Teh, authors have the right to republish it, in whole or part, in any publication of which they are an author or editor, and the make other personal use of the work.
منابع مشابه
Private Yoking Proofs: Attacks, Models and New Provable Constructions
We present two attacks on the security of the private grouping proof by Batina et al. [1]. We introduce the first formal models for yoking proofs. One model incorporates the aspect time, ensuring that the grouping proofs were generated at a specific time. A more general variant only provides a proof that tags were together at some time. Based on these models we propose two new protocols to gene...
متن کاملThe Effect of Intra-sentential, Inter-sentential and Tag- sentential Switching on Teaching Grammar
The present study examined the comparative effect of different types of code-switching, i.e., intrasentential,inter-sentential, and tag-sentential switching on EFL learners grammar learning andteaching. To this end, a sample of 60 Iranian female and male students in two different institutionsin Qazvin was selected. They were assigned to four groups. Each group was randomly assigned toone of the...
متن کاملProbabilistic yoking proofs for large scale IoT systems
Yoking (or grouping) proofs were introduced in 2004 as a security construction for RFID applications in which it is needed to build an evidence that several objects have been scanned simultaneously or, at least, within a short time. Such protocols were designed for scenarios where only a few tags (typically just two) are involved, so issues such as preventing an object from abandoning the proof...
متن کاملSecret Disclosure attack on Kazahaya, a Yoking-Proof For Low-Cost RFID Tags
Peris-Lopez et al. recently provides some guidelines that should be followed to design a secure yoking-proof protocol [10]. In addition, conforming to those guidelines and EPC C1 G2, they presented a yoking-proof for low-cost RFID tags, named Kazahaya. However, in this letter, we scrutinize its security showing how an passive adversary can retrieve secret parameters of patient’s tag in cost of ...
متن کاملA Novel Mutual Authentication Scheme Based on Quadratic Residues of RFID Tags
In 2004, Ari Juels [1] proposed a Yoking-Proofs protocol for RFID systems. The aim is to permit tags to generate a proof which is verifiable off-line by a trusted entity even when the readers are potentially untrusted. However, we find that their protocol not only doesn’t possess the anonymity property but also suffers from both of the off-line and replay attacks. In 2006, Kirk H.M. Wong et al....
متن کامل